COMPUTING SCIENCE Interval Temporal Logic Semantics of Box Algebra
نویسندگان
چکیده
منابع مشابه
Temporal Semantics of a Concurrency Monad with Choice and Services
We describe the concurrency monad of the functional language Opal, which realizes a smooth integration of concurrent processes in a purely functional framework , providing a general choice and client-server based communication. We develop an axiomatic semantics for the concurrency monad using a variant of temporal interval logic as syntactic sugar on top of the logic of computable functions .
متن کاملProbabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC ) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the system of probabilistic ITL with respect to an abstract semantics and a relative completeness theorem for the system of probabilistic DC with respect ...
متن کاملInterval and Point-based Approaches to Hybrid System Verification
Hybrid systems are real-time systems consisting of both continuous and discrete components. This thesis presents deductive and diagrammatic methodologies for proving point-based and intervalbased properties of hybrid systems, where the hybrid system is modeled in either a sampling semantics or a continuous semantics. Under a sampling semantics the behavior of the system consists of a discrete n...
متن کاملCompleteness of Neighbourhood Logic
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well as formalisation of many concepts of real analysis. These two modalities are also adequate in the sense that they can derive other important u...
متن کاملRuntime Verification of Traces under Recording Uncertainty
We present an on-line algorithm for the runtime checking of temporal properties, expressed as past-time Linear Temporal Logic (LTL) over the traces of observations recorded by a "black box"-like device. The recorder captures the observed values but not the precise time of their occurrences, and precise truth evaluation of a temporal logic formula cannot always be obtained. In order to handle th...
متن کامل